Skip trees, an alternative data structure to skip lists in a concurrent approach
نویسندگان
چکیده
منابع مشابه
Skip Trees, an Alternative Data Structure to Skip Lists in a Concurrent Approach
We present a new type of search trees, called Skip trees, which are a generalization of Skip lists. To be precise, there is a one-to-one mapping between the two data types which commutes with the sequential update algorithms. A Skip list is a data structure used to manage data bases which stores values in a sorted way and in which it is insured that the form of the Skip list is independent of t...
متن کاملSkip Lists - Some Results on a Recent Data Structure∗
The skip list is a list-based data structure introduced some years ago by Pugh [12]. In [6] an optimized version of the skip list search algorithm has been investigated and an asymptotic result on the variance of the total unsuccessful search cost has been derived. Here we give the precise asymptotics for the difference of the variance of this parameter and the variance of the total successful ...
متن کاملSkip lists: A randomized dictionary
The standard data structures for this problem is the balanced binary tree. It supports all the above operations in worst case time O(logn) and uses O(n) space. Well known classes of balanced trees are for example AVL-trees, BB[α]-trees and red-black-trees. In order to maintain their worst case time behaviour all those data structures need more or less elaborate rebalancing operations which make...
متن کاملBiased Skip Lists 1
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi , 1 ≤ i ≤ n, the time to access item i is O(1 + log(W/wi )), where W =∑n i=1 wi ; the data structure is dynamic. We present two instantiations of biased skip lists, one of which achieves this bound in the worst case, the other in the expected case. The stru...
متن کاملSkip Lift: A Probabilistic Alternative to Red-Black Trees
We present the Skip lifts, a randomized dictionary data structure inspired from the skip list [Pugh ’90, Comm. of the ACM]. Similarly to the skip list, the skip lifts has the finger search property: Given a pointer to an arbitrary element f , searching for an element x takes expected O(log δ) time where δ is the rank distance between the elements x and f . The skip lifts uses nodes of O(1) wors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1997
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1997310302511